#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool check(ll mid,ll x,ll y, vector<ll> v)
{
// cout<<"mid "<<mid<<endl;
ll cnt=0;
// for(ll i=0;i<v.size();i++)
// cout<<v[i]<<" ";
// cout<<endl;
for(ll i=mid;i<v.size();)
{
if(v[i]>x)
{
i++;
}
else
{
v[i]+=y;
cnt++;
}
if(cnt>mid)
return false;
}
return cnt<=mid;
}
int main() {
ll n,x,y;
cin>>n>>x>>y;
vector<ll> v(n);
for(ll i=0;i<n;i++)
cin>>v[i];
sort(v.begin(),v.end());
if(x>y)
{
cout<<n;
return 0;
}
ll ans;
ll l=0,h=n;
while(l<=h)
{
ll mid = (l+h)/2;
if(check(mid,x,y,v))
{
ans=mid;
h = mid-1;
// cout<<"yes"<<endl;
}
else
{
l = mid+1;
// cout<<"No"<<endl;
}
}
cout<<ans;
return 0;
}
Coprimes | Cost of balloons |
One String No Trouble | Help Jarvis! |
Lift queries | Goki and his breakup |
Ali and Helping innocent people | Book of Potion making |
Duration | Birthday Party |
e-maze-in | Bricks Game |
Char Sum | Two Strings |
Anagrams | Prime Number |
Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |
996A - Hit the Lottery | MSNSADM1 Football |
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |